单循环赛赛程安排的一个图论方法

利用图论的边着色理论建立了一个赛程安排的数学模型 .首先建立 n支球队与完全图 Kn的 n个顶点间的一一对应 ,把球队 Ai和 Aj间的比赛关系抽象成 Kn的顶点 i和 j间的边 ( i,j) .然后分别构造出了图K2 m- 1和 K2 m的正常 2 m-1边着色 .从而给出了各球队每两场比赛间得到的休整时间最均等 ,休整的间隔场次数达到上限值 n2 的一个赛程安排方案     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

Improved experimental tracking techniques for validating discrete element method simulations of tumbling mills

We report on further developments in the three-dimensional tracking of a particle deep within the tumbling ball charge of an experimental mill. The experimental X-ray program employing the use of bi-planar X-ray angiography now includes the tracking of a typical 6 mm bulk charge particle in three dimensions with a spatial resolution that is accurate to within 0.15 mm. The improved experimental tracking techniques presented were developed for the purpose of generating accurate three-dimensional particle trajectory data against which to validate a numerical method for the simulation of discrete media, namely the discrete element method (DEM). These improvements are complimented with techniques for comparing charge profiles between numerical DEM simulations and three-dimensional experimental trajectory data.     

Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutions

In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (a_ij), for all i and j it holds that a_ij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007     

On inequalities of Lieb-Thirring type

Applying the method proposed by Kashin for proving inequalities of Lieb-Thirring type for orthonormal systems, we prove a similar inequality in the multidimensional case.     

COMPLETENESS OF THE PARABOLIC SUBGROUPS OF PROJECTIVE ORTHOGONAL GROUPS

All parabolic subgroups and Borel subgroups of PΩ(2m 1, F) over a linear-able field F of characteristic 0 are shown to be complete groups, provided m > 3.     

立体视觉测量中的图像匹配策略研究

立体视觉测量广泛应用于机器人导向和各种柔性制造系统中 ,其中图像特征的准确匹配始终是一个难题。推导了共极性线方程 ,采取相关匹配和特征匹配相结合的方法来提高图像匹配的速度和精度 ,利用建模估计得到匹配像点的精确坐标 ,使三维测量精度达到目标距离的 1/10 0 0 0左右     

靶场光测多站图像多目标判读技术

靶场光测图像处理的一个突出难题是如何分辨图像上出现的大量小目标。利用单站序列图像上目标的运动关联、目标在多站图像上像点之间的对极几何约束关系,提出了靶场多站图像多目标判读的新技术,采用单站序列图像目标卡尔曼运动轨迹预测及跟踪识别技术,以及多站图像对极几何约束同名目标匹配技术,突破了传统方法仅进行单站图像判读的局限。仿真结果证明其能有效解决多站、多目标的判读问题,已成功应用于我们研制的多套靶场图像判读系统中。     

旋转带电体磁矩计算的若干法则与算例

本文在文献 [1]、[2 ]等的基础上给出关于旋转带电体的磁矩计算的若干法则 ,均以定理形式表达 ,并列表枚举其相关算例